Ensemble-based prediction of RNA secondary structures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars

Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...

متن کامل

Algorithms for the Prediction of Secondary Structures of RNA Macromolecules

In this paper, we tackle the problem of the prediction by energy computation of RNA stable secondary structures. We present, under the Hypothesis of Loops Dependent Energy (HLDE), our dynamic programming algorithm to compute the free energies of the stable secondary structures and our traceback algorithm to predict these structures. We compute the free energies of the stable secondary structure...

متن کامل

Prediction of RNA Secondary Structures by Genetic Algorithms

Many methods can be used to predict the secondary structure of an RNA molecule. One of the methods is the dynamic programming approach. However, the dynamic programming approach usually takes too much time. Thus, it is not very practical to solve the problem of long sequences with dynamic programming. RAGA (RNA Sequence Alignment by the Genetic Algorithm) is a genetic algorithm to align two sim...

متن کامل

TurboKnot: rapid prediction of conserved RNA secondary structures including pseudoknots

MOTIVATION Many RNA molecules function without being translated into proteins, and function depends on structure. Pseudoknots are motifs in RNA secondary structures that are difficult to predict but are also often functionally important. RESULTS TurboKnot is a new algorithm for predicting the secondary structure, including pseudoknotted pairs, conserved across multiple sequences. TurboKnot fi...

متن کامل

[A method for prediction of conserved RNA secondary structures].

The RNA secondary structure prediction is a classical problem in bioinformatics. The most efficient approach to this problem is based on the idea of a comparative analysis. In this approach the algorithms utilize multiple alignment of the RNA sequences and find common RNA structure. This paper describes a new algorithm for this task. This algorithm does not require predefined multiple alignment...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2013

ISSN: 1471-2105

DOI: 10.1186/1471-2105-14-139